Cubic time recognition of cocircuit graphs of uniform oriented matroids
نویسندگان
چکیده
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid. This improves an algorithm proposed by Babson, Finschi and Fukuda. Moreover we strengthen a result of Montellano-Ballesteros and Strausz about crabbed connectivity of cocircuit graphs of uniform oriented matroids.
منابع مشابه
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretical representations of oriented matroids, and all these methods work in general rank and for nonuniform and uniform oriented matroids as well. We consider two types of graphs, cocircuit graphs and tope graphs, and discus...
متن کاملA characterization of cocircuit graphs of uniform oriented matroids
The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J. Folkman, J. Lawrence, Oriented matroids, J. Combin. Theory Ser. B 25 (1978) 199–236]. In this paper we exhibit a characterization of such graphs (for the uniform case) via their natural embedding into Qn—the 1-skeleto...
متن کاملPolynomial Time Recognition of Uniform Cocircuit Graphs
We present an algorithm which takes a graph as input and decides in polynomial time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid.
متن کاملOn the Circuit-cocircuit Intersection Conjecture
Oxley has conjectured that for k ≥ 4, if a matroidM has a k-element set that is the intersection of a circuit and a cocircuit, thenM has a (k− 2)-element set that is the intersection of a circuit and a cocircuit. In this paper we prove a stronger version of this conjecture for regular matroids. We also show that the stronger result does not hold for binary matroids.
متن کاملOn tope graphs of complexes of oriented matroids
We give two graph theoretical characterizations of tope graphs of (complexes of) oriented matroids. The first is in terms of excluded partial cube minors, the second is that all antipodal subgraphs are gated. A direct consequence is a third characterization in terms of zone graphs of tope graphs. Further corollaries include a characterization of topes of oriented matroids due to da Silva, anoth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 32 شماره
صفحات -
تاریخ انتشار 2011